Decomposing Hypergraphs into Simple Hypertrees
نویسنده
چکیده
Let T be a simple k-uniform hypertree with t edges. It is shown that if H is any k-uniform hypergraph with n vertices and with minimum degree at least n k−1 2k−1(k−1)! (1+o(1)), and the number of edges of H is a multiple of t then H has a T -decomposition. This result is asymptotically best possible for all simple hypertrees with at least two edges. Mathematics Subject Classification (1991): 05C65, 05C70.
منابع مشابه
Chromatic Symmetric Functions of Hypertrees
The chromatic symmetric function XH of a hypergraph H is the sum of all monomials corresponding to proper colorings of H. When H is an ordinary graph, it is known that XH is positive in the fundamental quasisymmetric functions FS , but this is not the case for general hypergraphs. We exhibit a class of hypergraphs H — hypertrees with prime-sized edges — for which XH is F -positive, and give an ...
متن کاملOn chromaticity of hypergraphs
Let H = (X,E) be a simple hypergraph and let f (H, ) denote its chromatic polynomial. Two hypergraphs H1 and H2 are chromatic equivalent if f (H1, ) = f (H2, ). The equivalence class of H is denoted by 〈H 〉. Let K and H be two classes of hypergraphs.H is said to be chromatically characterized in K if for every H ∈ H ∩K we have 〈H 〉 ∩K=H ∩K. In this paper we prove that uniform hypertrees and uni...
متن کاملFlows on hypergraphs
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and fo...
متن کاملHypergraphs and a functional equation of Bouwkamp and de Bruijn
Let Φ(u, v) = ∑ ∞ m=0 ∑ ∞ n=0 cmnu v. Bouwkamp and de Bruijn found that there exists a power series Ψ(u, v) satisfying the equation tΨ(tz, z) = log (∑ ∞ k=0 t k k! exp(kΦ(kz, z)) ) . We show that this result can be interpreted combinatorially using hypergraphs. We also explain some facts about Φ(u, 0) and Ψ(u, 0), shown by Bouwkamp and de Bruijn, by using hypertrees, and we use Lagrange inversi...
متن کاملEfficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 20 شماره
صفحات -
تاریخ انتشار 2000